Genetic Algorithm based Solution for the Hub Location Problem
نویسنده
چکیده
Design of network, through which data, packages or even people can be transported, is an important issue for achieving a desired level of service quality at an acceptable cost. For this purpose, it is possible to design a network comprised of nodes that are connected to each other with dedicated lines. However, this kind of solution will not be cost effective. In order to decrease the total transportation cost some facilities (hubs), which behave as consolidation or routing point for other nodes, can be used. Airlines, logistic firms, postal offices and telecommunication companies make use of hubs for building this type of network. A challenging point with hubs is to decide which nodes will be used as hub location points where characteristics of the network may differ. This study will investigate previous works about hub location problems. A genetic algorithm based solution is proposed and implemented to the problem. Experimental results show that the proposed architecture can be used for designing this type of hub networks. Key Word:-Hub location, Genetic Algorithm, Hub-spoke network, Uncapacitated Hub, p-Hub,p-Center.
منابع مشابه
Mathematical model for P-hub location problem under simultaneous disruption
The optimal locating of facilities has large effects on economic benefits, providing satisfactory service and levels of customer satisfaction. One of the new topics discussed in location problems is hub location and hub facilities are subject to unpredictable disruptions. This paper proposes a nonlinear integer model for reliable single allocation hub location problem that considers backup hub,...
متن کاملA Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملTwo-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کامل